Statically Resolvable Ambiguity

Traditionally, a grammar defining the syntax of programming language is typically both context free and unambiguous. However, recent work suggests that an attractive alternative to use ambiguous grammars,thus postponing task resolving ambiguity end user. If all programs accepted by can be rewritten unambiguously, then parser for said resolvably ambiguous. Guaranteeing resolvable statically---for programs---is hard, where previous only solves it partially using techniques based on property-based testing. In this paper, we present first efficient, practical, proven correct solution statically problem. Our approach introduces several key ideas, including splittable productions, operator sequences, concept grouper works in tandem with standard parser. We prove static resolvability Coq mechanization demonstrate its efficiency practical applicability implementing integrating into essential part OCaml